Combining Constraint Programming and Simulated Annealing on University Exam Timetabling
نویسندگان
چکیده
—In this paper, we present a solution method for examination timetabling, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with Kempe chain neighborhood. The second phase is equipped with some refined mechanisms that help to determine crucial cooling schedule parameters. We perform preliminary experiments of the algorithm on real data sets.
منابع مشابه
A Hybrid Algorithm for the Examination Timetabling Problem
Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the Univers...
متن کاملMemetic Algorithm and its Application to the Arrangement of Exam Timetable
This paper looks at Memetic Algorithm for solving timetabling problems. We present a new memetic algorithm which consists of global search algorithm and local search algorithm. In the proposed method, a genetic algorithm is chosen for global search algorithm while a simulated annealing algorithm is used for local search algorithm. In particular, we could get an optimal solution through the .NET...
متن کاملA genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملTimetabling at German Secondary Schools: Tabu Search versus Constraint Programming
In recent years many solution approaches for different school timetabling problems (TTP) have been tried, among them tabu search, simulated annealing, genetic algorithms, and constraint programming [8]. However, most of the solution methods developed so far have been tested by means of only few (mostly only a handful) problem instances [6]. Further, until today there are nearly no reports on te...
متن کاملUsing Simulated Annealing to study behaviour of various Exam Timetabling data sets
In this paper we use a simple simulated annealing (SA) metaheuristic as the basis for comparing behaviour of a number of different examination timetabling problems when optimised from initial solutions given by a largest degree graph-colouring heuristic with backtracking. The ultimate aim of our work is to develop a measure of similarity between exam timetabling problems. By similarity we mean ...
متن کامل